On Ryser's maximum term rank formula

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Maximum Rank Aggregation Problems

The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based on the preferences of individual voters. These are expressed by permutations, whose distance can be measured in many ways. In this work we study a collection of distances, including the Kendall tau, Spearman footrule, Spearman rho, Cayley, Hamming, Ulam, and Minkowski distances, and compute the ...

متن کامل

Maximum rank matrix completion

The maximum rank completion problem is the problem of, given a partial matrix (that is, a matrix where we are only given some of the entries), ll in the unknown entries in such a way as to maximize the rank. Applications include bipartite matching and matroid intersection for linearly represented matroids. We describe an algorithm that nds a maximum rank completion by perturbing an arbitrary co...

متن کامل

Maximum Rank Query

The top-k query is a common means to shortlist a number of options from a set of alternatives, based on the user’s preferences. Typically, these preferences are expressed as a vector of query weights, defined over the options’ attributes. The query vector implicitly associates each alternative with a numeric score, and thus imposes a ranking among them. The top-k result includes the k options w...

متن کامل

A Lefschetz formula for higher rank

In this paper a Lefschetz formula is proved for the geodesic flow of a compact locally symmetric space. The flow is described in terms of actions of split tori of various dimensions and the geometric side of the Lefschetz formula is a sum over closed geodesics which correspond to a given torus. The cohomological side is given in terms of Lie algebra cohomology.

متن کامل

Maximum Rank and Asymptotic Rank of Finite Dynamical Systems

A finite dynamical system is a system of multivariate functions over a finite alphabet. The main feature of a finite dynamical system is its interaction graph, which indicates which local functions depend on which variables. The rank of a finite dynamical system is the cardinality of its image; the asymptotic rank is the number of its periodic points. In this paper, we determine the maximum ran...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1980

ISSN: 0024-3795

DOI: 10.1016/0024-3795(80)90228-1